Axiomatic Proofs through Automated Reasoning*

search of the seminal papers and significant books devoted to the study of various types of logic t e reveals that many proofs are missing. Indeed, if one seeks an axiomatic proof (of the type that Hilber njoyed) relying solely on, say, condensed detachment, in many cases one finds that none is offered by d t the literature. In part prompted by this discovery, we embarked on an intense study designed to fin he missing proofs. In this article, we list many of our successes and discuss the methodologies used to e o obtain them. We also show how OTTER has proved valuable in finding proofs that avoid both the us f perhaps-thought-to-be indispensable lemmas and the use of an unexpected class of terms. Because e i crucial to our attack was the use of the automated reasoning program OTTER, we include an intuitiv ntroduction to the subject. OTTER may well prove useful as an assistant in the research of others.